Parallelizing multidimensional index structures
نویسندگان
چکیده
Indexing multidimensional data is inherently complex leading to slow query processing. This behavior becomes more pronounced with the increase in database size and/or number of dimensions. In this paper, we address this issue by processing an index structure in parallel. First, we study different ways of partitioning an index structure. We then propose efficient algorithms for processing each query in parallel on the index structure. Using these strategies, we parallelized two multidimensional index structures – R* and LIB and evaluated the performance gains for the Gazetteer and the Catalog data of the Alexandria Digital Library on the Meiko CS-2.
منابع مشابه
Parallelizing multidimensional indexes for main memory databases
Parallelizing multidimensional indexes for main memory databases Master thesis,
متن کاملImplementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient query processors being able to deal with high-dimensional data. Inside such a query processor, multidimensional index structures are used as a basic technique. As the implementation of such an index structures is a diffic...
متن کاملParallel Query Support for Multidimensional Data: Intra-object Parallelism
Intra-query parallelism is a well-established mechanism for achieving high performance in (object-) relational database systems. However, the methods have yet not been applied to the upcoming field of multidimensional array databases. Specific properties of multidimensional array data require new parallel algorithms. This paper presents a number of new techniques for parallelizing queries in mu...
متن کاملIntra-Query Parallelism for Multidimensional Array Data
Intra-query parallelism is a well-established mechanism for achieving high performance in (object-) relational database systems. However, the methods have yet not been applied to the upcoming field of multidimensional array databases. Specific properties of multidimensional array data require the adaptation of established methods but also new parallel algorithms. This paper presents a discussio...
متن کاملA Mapping Based Approach for Multidimensional Data Indexing
The most common approach to improve performance for databases is through indexing. Mapping based approach is an easy to implement paradigm for indexing multidimensional data. It does not need complicated structures or algorithms, but some transformations (mapping functions) to convert multidimensional data to one dimensional data. Then the converted data can be indexed using a robust and effici...
متن کامل